Semi-supervised multi-label image classification based on nearest neighbor editing
نویسندگان
چکیده
Semi-supervised multi-label classification has been applied to many real-world applications such as image classification, document classification and so on. In semi-supervised learning, unlabeled samples are added to the training set for enhancing the classification performance, however, noises are introduced simultaneously. In order to reduce this negative effect, the nearest neighbor data editing technique is introduced to semi-supervised multi-label classification, and thus an algorithm named Multi-Label Self-Training with Editing (MLSTE) is proposed in this work. The proposed algorithm is able to solve the uncertainty problem in semi-supervised multi-label classification to some extent, by improving the performance of determining the label number and selecting confident samples during the course of semi-supervised learning. Extensive experimental results on several benchmark datasets have been carried out to verify the effectiveness of the proposed MLSTE algorithm. & 2013 Elsevier B.V. All rights reserved.
منابع مشابه
ON SUPERVISED AND SEMI-SUPERVISED k-NEAREST NEIGHBOR ALGORITHMS
The k-nearest neighbor (kNN) is one of the simplest classification methods used in machine learning. Since the main component of kNN is a distance metric, kernelization of kNN is possible. In this paper kNN and semi-supervised kNN algorithms are empirically compared on two data sets (the USPS data set and a subset of the Reuters-21578 text categorization corpus). We use a soft version of the kN...
متن کاملA Comparison of Graph Construction and Learning Algorithms for Graph-Based Phonetic Classification
Graph-based semi-supervised learning (SSL) algorithms have been widely applied in large-scale machine learning. In this work, we show different graph-based SSL methods (modified adsorption, measure propagation, and prior-based measure propagation) and compare them to the standard label propagation algorithm on a phonetic classification task. In addition, we compare 4 different ways of construct...
متن کاملTri-training and Data Editing Based Semi-supervised Clustering Algorithm
Semi-Supervised clustering algorithms often utilize a seeds set consisting of a small amount of labeled data to initialize cluster centroids, hence improve the clustering performance over whole data set. Both the scale and quality of seeds set directly restrict the performance of semi-supervised clustering algorithm. In this paper, a new algorithm named DE-Tri-training semi-supervised K-means i...
متن کاملML-KNN: A lazy learning approach to multi-label learning
Multi-label learning originated from the investigation of text categorization problem, where each document may belong to several predefined topics simultaneously. In multi-label learning, the training set is composed of instances each associated with a set of labels, and the task is to predict the label sets of unseen instances through analyzing training instances with known label sets. In this...
متن کاملImproved Nearest Neighbor Methods For Text Classification
We present new nearest neighbor methods for text classification and an evaluation of these methods against the existing nearest neighbor methods as well as other well-known text classification algorithms. Inspired by the language modeling approach to information retrieval, we show improvements in k-nearest neighbor (kNN) classification by replacing the classical cosine similarity with a KL dive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Neurocomputing
دوره 119 شماره
صفحات -
تاریخ انتشار 2013